Packing edge-disjoint triangles in regular and almost regular tournaments
نویسندگان
چکیده
منابع مشابه
Packing edge-disjoint triangles in regular and almost regular tournaments
For a tournament T , let ν3(T ) denote the maximum number of pairwise edge-disjoint triangles (directed cycles of length 3) in T . Let ν3(n) denote the minimum of ν3(T ) ranging over all regular tournaments with n vertices (n odd). We conjecture that ν3(n) = (1 + o(1))n /9 and prove that n 11.43 (1− o(1)) ≤ ν3(n) ≤ n 9 (1 + o(1)) improving upon the best known upper bound of n −1 8 and lower bou...
متن کاملPacking arc-disjoint triangles in regular and almost regular tournaments
For a tournament T , let ν3(T ) denote the maximum number of pairwise arc-disjoint triangles in T . Let ν3(n) denote the minimum of ν3(T ) ranging over all regular tournaments with n vertices (n odd). It is conjectured that ν3(n) = (1 + on(1))n /9 and proved that n 11.43 (1− on(1)) ≤ ν3(n) ≤ n 9 (1 + on(1)) improving upon the best known upper bound and lower bound. The result is generalized to ...
متن کاملPacking Triangles in Regular Tournaments
We prove that a regular tournament with n vertices has more than n 2 11.5 (1 − o(1)) pairwise arc-disjoint directed triangles. On the other hand, we construct regular tournaments with a feedback arc set of size less than n 2 8 , so these tournaments do not have n 8 pairwise arc-disjoint triangles. These improve upon the best known bounds for this problem.
متن کاملPacking Edge-Disjoint Triangles in Given Graphs
Given a graph G, we consider the problem of finding the largest set of edge-disjoint triangles contained in G. We show that even the simpler case of decomposing the edges of a sparse split graph G into edge-disjoint triangles is NP-complete. We show next that the case of a general G can be approximated within a factor of 3 5 in polynomial time, and is NP-hard to approximate within some constant...
متن کاملPacking Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of applications in many areas, especially computational biology [BP96]. In this paper we present an analysis of the problem from a parameterized complexity viewpoint. We describe a fixed-parameter tractable algorithm for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.09.010